Performance Evaluation of Integrated Fault-Tolerant Technique: Simulation Study

In earlier work we have proposed the concept of the dynamic group maximum matching for grouping the system graph into groups of different sizes according to the tasks arriving at the system. Also, we have developed a more efficient integrated fault-tolerant technique for ultra-reliable execution of tasks where both hardware (processors and communication channels) and software failures, and on-line fault diagnosis are considered. The proposed approach called the Integrated Fault-Tolerant (IFT) approach. Furthermore, we have proposed integrated fault-tolerant scheduling algorithms. The introduced algorithms are based on the dynamic group maximum matching concept and the IFT technique. In this work, we studied the effect of the IFT technique on system performance for four of the proposed scheduling algorithms. The algorithms are: Integrated Fault-Tolerant First-Come, First-Served (FCFS), Integrated Fault-Tolerant (FCFS + Smallest Fits First) (FCFSSFF) scheduling algorithm, Integrated Fault-Tolerant (FCFS + Largest Fits First) (FCFSLFF) scheduling algorithm, and Integrated Fault-Tolerant (FCFS + First Fits First) (FCFSFFF) scheduling algorithm. We considered two performance metrics: system mean response time and percentage of completed tasks of specific type.